Farthest First Clustering in Links Reorganization
نویسندگان
چکیده
منابع مشابه
Farthest Centroids Divisive Clustering ∗ Haw - ren
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into two subsets whose centroids are farthest from each other, and the process is repeated recursively on each subset. The bisection task can be formulated as an integer programming problem, which is NP-hard. Instead, an ap...
متن کاملAn Automated Diagnosis Of Breast Cancer Using Farthest First Clustering And Decision Tree J48 Classifier
Breast cancer is one of the most widespread and deadly cancer for women. Early diagnosis and treatment of breast cancer can enhance the outcome of the patients. Due to the difficulties of outlier and skewed data, the prediction of breast cancer survey has presented many challenges in the field of data mining and pattern recognition .To solve these troubles, we have proposed an automated breast ...
متن کاملReorganization of Links to Improve User Navigation
Website can be easily design but to efficient user navigation is not a easy task since user behavior is keep changing and developer view is quite different from what user wants, so to improve navigation one way is reorganization of website structure. For reorganization here proposed strategy is farthest first traversal clustering algorithm perform clustering on two numeric parameters and for fi...
متن کاملFeature Selection for Clustering by Exploring Nearest and Farthest Neighbors
Feature selection has been explored extensively for use in several real-world applications. In this paper, we propose a new method to select a salient subset of features from unlabeled data, and the selected features are then adaptively used to identify natural clusters in the cluster analysis. Unlike previous methods that select salient features for clustering, our method does not require a pr...
متن کاملFarthest-Point Heuristic based Initialization Methods for K-Modes Clustering
The k-modes algorithm has become a popular technique in solving categorical data clustering problems in different application domains. However, the algorithm requires random selection of initial points for the clusters. Different initial points often lead to considerable distinct clustering results. In this paper we present an experimental study on applying a farthest-point heuristic based init...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International journal of Web & Semantic Technology
سال: 2014
ISSN: 0976-2280,0975-9026
DOI: 10.5121/ijwest.2014.5302